New Families of Odd Graceful Graphs
نویسنده
چکیده
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by fusing all the n vertices of Cn of even order with the apex vertices of n copies of K1,m admits odd graceful labeling. In addition to this we show that the shadow graphs of path Pn and star K1,n are odd graceful graphs.
منابع مشابه
Snakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملImproper Graceful and Odd-graceful Labellings of Graph Theory
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
متن کاملOdd Graceful Labeling of Some New Type of Graphs
In this paper some new type of odd graceful graphs are investigated. We prove that the graph obtained by joining a cycle C8 with some star graphs S1,r keeping one vertex and three vertices gap between pair of vertices of the cycle admits odd graceful labelling. We also prove that the graph obtained by joining a cycle C12 with some star graphs S1,r keeping two, three and five vertices gap betwee...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملOn Odd Graceful Labeling of the Generalization of Cyclic Snakes
The objective of this paper is to present a new class of odd graceful graphs. In particular, we show that the linear cyclic snakes (1, k) C4snake and (2, k) C4snake are odd graceful. We prove that the linear cyclic snakes (1, k) C6snake and (2, k) C6snake are odd graceful. We also prove that the linear cyclic snakes (1, k) C8snake and (2, k) C8snake are odd graceful. We generalize the above res...
متن کامل